
public class BinaryTree {
		
	static class Node	{
		Node left;
		Node right;
		char data;
		
		Node(char newData)	{
			left = null;
			right = null;
			data = newData;
		}
	}
	
	private Node root;	
	
	public void BinaryTree(char[] inOrder,char[] preOrder)	{
		root.data = preOrder[0];
		int rootId = 0;
		
		for (int i=0; i<inOrder.length; i++)	{
			if (inOrder[i] == root.data)	{
				rootId = i;
				break;
			}
		}
		
		char[] leftInOrder = new char[rootId];
		char[] rightInOrder = new char[inOrder.length - rootId -1];
	}
	
	public void add(char data)	{
		
	}
}
